New Secret Key Traitor Tracing Scheme with Dispute Settlement from Bilinear Maps

We propose a new secret key traitor tracing scheme using bilinear maps, in which the size of the enabling-block in a broadcast message is independent of the number of subscribers. The proposed traitor tracing scheme can identify malicious subscribers (also called traitors) from a pirate decoder, which is collusively made by k or fewer traitors. Further, any malicious subscriber cannot falsify an unintended content for framing the broadcast center and cause all other personal keys to be exposed. We also give formal analyses to discuss the security of the proposed scheme in the random oracle model.